Maximizing concave piecewise affine functions on the unitary group
نویسندگان
چکیده
منابع مشابه
Maximizing Concave Functions in Fixed Dimension
In the authors introduced a technique which enabled them to solve the parametric minimum cycle problem with a xed number of parameters in strongly polynomial time In the current paper we present this technique as a general tool In order to allow for an independent reading of this paper we repeat some of the de nitions and propositions given in Some proofs are not repeated however and instead we...
متن کاملOn Coordinate Minimization of Convex Piecewise-Affine Functions
A popular class of algorithms to optimize the dual LP relaxation of the discrete energy minimization problem (a.k.a. MAP inference in graphical models or valued constraint satisfaction) are convergent message-passing algorithms, such as max-sum diffusion, TRW-S, MPLP and SRMP. These algorithms are successful in practice, despite the fact that they are a version of coordinate minimization applie...
متن کاملMaximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IR and a piecewise polynomial concave function F :P → IR. Let A be an algorithm that given a point x ∈ IR computes F (x) if x ∈ P, or returns a concave polynomial p such that p(x) < 0 but for any y ∈ P, p(y) ≥ 0. We assume that d is fixed and that all comparisons in A depend on the sign of polynomial functions of the input point. We show that under these conditions, o...
متن کاملThe Sugeno fuzzy integral of concave functions
The fuzzy integrals are a kind of fuzzy measures acting on fuzzy sets. They can be viewed as an average membershipvalue of fuzzy sets. The value of the fuzzy integral in a decision making environment where uncertainty is presenthas been well established. Most of the integral inequalities studied in the fuzzy integration context normally considerconditions such as monotonicity or comonotonicity....
متن کاملIrredundant lattice representations of continuous piecewise affine functions
In this paper, we revisit the lattice representation of continuous piecewise affine (PWA) function and give a formal proof of its representation ability. Based on this, we derive the irredundant lattice PWA representation through removal of redundant terms and literals. Necessary and sufficient conditions for irredundancy are proposed. Besides, we explain how to remove terms and literals in ord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2015
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-015-0951-y